Practical extensions to a minimum cost flow model for level of repair analysis
نویسندگان
چکیده
Given a product design and a repair network for capital goods, a level of repair analysis determines for each component in the product (1) whether it should be discarded or repaired upon failure and (2) at which location in the repair network to do this. In this paper, we show how the problem can be modelled as a minimum cost flow problem with side constraints. Advantages are that (1) solving our model requires less computational effort than solving existing models and (2) we achieve a high model flexibility, i.e., many practical extensions can be added. Furthermore, we analyse the added value of modelling the exact structure of the repair network, instead of aggregating all data per echelon as is common in the literature. We show that in some cases, cost savings of over 7% can be achieved. We also show when it is sufficient to model the repair network by echelons only, which requires less input data.
منابع مشابه
A Minimum Cost Flow model for Level of Repair Analysis
Given a product design and a repair network for capital goods, a level of repair analysis determines for each component in the product (1) whether it should be discarded or repaired upon failure and (2) at which location in the repair network to do this. In this paper, we show how the problem can be modelled as a minimum cost flow problem with side constraints. Advantages are that (1) solving o...
متن کاملPractical extensions to the level of repair analysis
The level of repair analysis (lora) gives answers to three questions that are posed when deciding on how to maintain capital goods: 1) which components to repair upon failure and which to discard, 2) at which locations in the repair network to perform each type of repairs, and 3) at which locations in the network to deploy resources, such as test equipment. The goal is to achieve the lowest pos...
متن کاملOptimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملThe Minimum Universal Cost Flow in an Infeasible Flow Network
In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.
متن کاملMaintenance Cost Analysis for Replacement Model with Perfect Minimal Repair
With the evolution of technology, the maintenance of sophisticated systems is of concern for system engineers and system designers. The maintenance cost of the system depends in general on the replacement and repair policies. The system replacement may be in a strictly periodic fashion or on a random basis depending upon the maintenance policy. At failure, the repair of the system may be perfor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 211 شماره
صفحات -
تاریخ انتشار 2011